Two NP-hard interchangeable terminal problems
نویسندگان
چکیده
Two subproblems that arise when routing channels with interchangeable terminals are shown to be NP-hard. These problems are: P1: Is there a net to terminal assignment that results in an acyclic vertical constraint graph? P2: For instances with acyclic vertical constraint graphs, obtain net to terminal assignments for which the length of the longest path in the vertical constraint graph is minimum.
منابع مشابه
Planar Interchangeable 2-terminal Routing
abstract Many practical routing problems such as BGA, PGA and test xture routing involve routing two-terminal nets on a plane with exchangeable pins. In this paper, we unify these diierent problems as instances of the Planar Interchangeable 2-Terminal Routing (PI2TR) problem. We formulate the problem as ows in a routing network. Secondly, we show that PI2TR is NP-complete by reduction from sati...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملStructure and Intractability of Optimal Multi-Robot Path Planning on Graphs
In this paper, we study the structure and computational complexity of optimal multi-robot path planning problems on graphs. Our results encompass three formulations of the discrete multi-robot path planning problem, including a variant that allows synchronous rotations of robots along fully occupied, disjoint cycles on the graph. Allowing rotation of robots provides a more natural model for mul...
متن کاملA population-based algorithm for the railroad blocking problem
Railroad blocking problem (RBP) is one of the problems that need an important decision in freight railroads. The objective of solving this problem is to minimize the costs of delivering all commodities by deciding which inter-terminal blocks to build and by specifying the assignment of commodities to these blocks, while observing limits on the number and cumulative volume of the blocks assemble...
متن کاملMaximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
In this paper, we deal with the maximum integer multiflow and theminimum multicut problems in rectilinear grid graphs with uniformcapacities on the edges. The first problem is known to be NP-hardwhen any vertex can be a terminal, and we show that the second oneis also NP-hard. Then, we study the case where the terminals arelocated in a two-sided way on the boundary of the ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. on CAD of Integrated Circuits and Systems
دوره 7 شماره
صفحات -
تاریخ انتشار 1988